Specialized Interior-Point Algorithm for Stable Nonlinear System Identification
نویسندگان
چکیده
منابع مشابه
Specialized Interior Point Algorithm for Stable Nonlinear System Identification
Estimation of nonlinear dynamic models from data poses many challenges, including model instability and non-convexity of long-term simulation fidelity. Recently Lagrangian relaxation has been proposed as a method to approximate simulation fidelity and guarantee stability via semidefinite programming (SDP), however the resulting SDPs have large dimension, limiting their utility in practical prob...
متن کاملsystem identification by a generalized interior point algorithm and nonlinear optimization methods considering arma model
in this paper, we describe our implementation of an interior point algorithm for large scale systems. first we identify system with small and medium methods convex optimization, then we use interior point method for identification. finally we offer an interior point method that uses nonlinear cost function and see that we achieve a good trade-off between error and cpu time. actually, in this pa...
متن کاملA Specialized Interior-Point Algorithm for Multicommodity Network Flows
Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The new specialized interior-point algorithm presented here overcomes this drawback. This specialization uses both a preconditioned conjugate gradient solver and a sparse Cholesky factorization to solve a linear system of equations a...
متن کاملSolving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm
Due to recent advances in the development of linear programming solvers, some of the formerly considered difficult multicommodity problems can today be solved in few minutes, even faster than with specialized methods. However, for other kind of multicommodity instances, general linear solvers can still be quite inefficient. In this paper we will give an overview of the current state-of-the-art ...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2867358